On the equivalence problem of context-free and DT0L languages

On the Equivalence Problem of Context-free and DT0L Languages

It is undecidable whether or not a given context-free language and a propagating DT0L language are equal. We show that equivalence is decidable between context-free and everywhere growing DT0L languages.

on the comparison of keyword and semantic-context methods of learning new vocabulary meaning

the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...

Testing Equivalence of Morphisms on Context-Free Languages

Three Variants of the DT0L Sequence Equivalence Problem

We discuss three variants of the DT0L sequence equivalence problem. One of the variants generalizes the ω-sequence equivalence problem of D0L systems for DT0L systems.

On the unary equivalence of stochastic languages and stochastic context-free languages

We show that every unary stochastic context-free grammar with polynomially bounded ambiguity, has an equivalent probabilistic automaton.